Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
نویسندگان
چکیده
منابع مشابه
Asymptotic enumeration of Eulerian circuits for graphs with strong mixing properties
Let G be a simple connected graph all of whose vertices have even degrees. An Eulerian circuit in G is a closed walk (see, for example, [2]) which uses every edge of G exactly once. Two Eulerian circuits are called equivalent if one is a cyclic permutation of the other. It is clear that the size of such an equivalence class equals the number of edges of graph G. Let EC(G) denote the number of e...
متن کاملAsymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, constrained to use each edge at most once, is taken on Kn, then the probability that all the edges are eventually used is asymptotic to en. Some similar results are obtained about eulerian circuits and spanning trees i...
متن کاملAsymptotic enumeration of Eulerian digraphs with multiple edges
2. Main result. By an eulerian digraph we mean a digraph in which the in-degree is equal to the out-degree at each vertex. Let ED ME ( n, t) be the number of labelled loop-free eulerian digraphs with n vertices in which the multiplicity of each edge is at most t. Allowing loops would multiply ED ME (n, t) by exactly (t + 1) n, since loops do not affect the eulerian property. For the case where ...
متن کاملOn the class of graphs with strong mixing properties
We study three mixing properties of a graph: large algebraic connectivity, large Cheeger constant (isoperimetric number) and large spectral gap from 1 for the second largest eigenvalue of the transition probability matrix of the random walk on the graph. We prove equivalence of this properties (in some sense). We give estimates for the probability for a random graph to satisfy these properties....
متن کاملEnumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time, and gn is asymptotically g n −5/2ρ−n, where g ≈ 0.00909941 and ρ−1 ≈ 7.50360 can be approximated. Using our enumerative results we investigate several statistical properties of random unlabeled outerplanar graphs on n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Izvestiya: Mathematics
سال: 2013
ISSN: 1064-5632,1468-4810
DOI: 10.1070/im2013v077n06abeh002671